Using the theory of cyclotomy to factor cyclotomic polynomials over finite fields
نویسنده
چکیده
We examine the problem of factoring the rth cyclotomic polynomial, Φr(x), over Fp, r and p distinct primes. Given the traces of the roots of Φr(x) we construct the coefficients of Φr(x) in time O(r4). We demonstrate a deterministic algorithm for factoring Φr(x) in time O((r1/2+ log p)9) when Φr(x) has precisely two irreducible factors. Finally, we present a deterministic algorithm for computing the sum of the irreducible factors of Φr(x) in time O(r6).
منابع مشابه
Generalized reciprocals, factors of Dickson polynomials and generalized cyclotomic polynomials over finite fields
We give new descriptions of the factors of Dickson polynomials over finite fields in terms of cyclotomic factors. To do this generalized reciprocal polynomials are introduced and characterized. We also study the factorization of generalized cyclotomic polynomials and their relationship to the factorization of Dickson polynomials.
متن کاملUsing of Generalized Cyclotomy for Sequence Design over the Finite Field of Order Four with High Linear Complexity
We consider the use of generalized Ding-Helleseth cyclotomy to design sequences over the finite field of order four. Using generalized cyclotomic classes of order four we obtain the family of balanced sequences of odd period with high linear complexity. Also we present a method of constructing sequences with high linear complexity and arbitrary even period over the finite field of order four. T...
متن کاملDucci-sequences and cyclotomic polynomials
We study Ducci-sequences using basic properties of cyclotomic polynomials over F2. We determine the period of a given Ducci-sequence in terms of the order of a polynomial, and in terms of the multiplicative orders of certain elements in finite fields. We also compute some examples and study links between Duccisequences, primitive polynomials and Artin’s conjecture on primitive roots. © 2005 Els...
متن کاملTrading GRH for algebra: algorithms for factoring polynomials and related structures
In this paper we develop techniques that eliminate the need of the Generalized Riemann Hypothesis (GRH) from various (almost all) known results about deterministic polynomial factoring over finite fields. Our main result shows that given a polynomial f(x) of degree n over a finite field k, we can find in deterministic poly(n n, log |k|) time either a nontrivial factor of f(x) or a nontrivial au...
متن کاملOn explicit factors of cyclotomic polynomials over finite fields
We study the explicit factorization of 2nr-th cyclotomic polynomials over finite field Fq where q, r are odd with (r, q) = 1. We show that all irreducible factors of 2nr-th cyclotomic polynomials can be obtained easily from irreducible factors of cyclotomic polynomials of small orders. In particular, we obtain the explicit factorization of 2n5-th cyclotomic polynomials over finite fields and co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Comput.
دوره 70 شماره
صفحات -
تاریخ انتشار 2001